The Sphere Packing Bound for Memoryless Channels
نویسندگان
چکیده
منابع مشابه
The Augustin center and the sphere packing bound for memoryless channels
For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. AugustinLegendre capacity, center, and radius are introduced and proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing bounds with polynomial prefactors are derived for codes on two families of channels: ...
متن کاملAn Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...
متن کاملA sphere packing bound on Rayleigh block-fading MIMO channels
We present a sphere packing bound (SPB) approach to investigate the performance limits of Rayleigh block-fading, multiple antenna systems. Specifically, we derive three sphere packing lower bounds, one tight, one loose, and one approximate, on average word error probability of space-time codes. These bounds provide us intuition on how system parameters affect the performance limits [1]. It is s...
متن کاملThe Sphere Packing Bound via Augustin's Method
The channel coding problem is reviewed for an abstract framework. If the scaled Renyi capacities of a sequence of channels converge to a finite continuous function φ on an interval of the form (1− ε, 1] for an ε > 0, then the capacity of the sequence of channels is φ(1). If the convergence holds on an interval of the form (1 − ε, 1 + ε) then the strong converse holds. Both hypotheses hold for l...
متن کاملAn outer bound for 2-receiver discrete memoryless broadcast channels
An outer bound to the discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2020
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946020030011